Upper Bounds for Coarsening for the Deep Quench Obstacle Problem

نویسنده

  • AMY NOVICK-COHEN
چکیده

The deep quench obstacle problem models phase separation at low temperatures. During phase separation, domains of high and low concentration are formed, then coarsen or grow in average size. Of interest is the time dependence of the dominant length scales of the system. Relying on recent results by Novick-Cohen & Shishkov [16], we demonstrate upper bounds for coarsening for the deep quench obstacle problem, with either constant or degenerate mobility. For the case of constant mobility, we obtain upper bounds of the form t at early times as well as at times t for which E(t) ≤ (1−u 2) 4 , where E(t) denotes the free energy. For the case of degenerate mobility, we get upper bounds of the form t or t at early times, depending on the value of E(0), as well as bounds of the form t whenever E(t) ≤ (1−u 2) 4 .

منابع مشابه

Refined Upper Bounds on the Coarsening Rate of Discrete, Ill-posed Diffusion Equations

We study coarsening phenomena observed in discrete, ill-posed diffusion equations that arise in a variety of applications, including computer vision, population dynamics, and granular flow. Our results provide rigorous upper bounds on the coarsening rate in any dimension. Heuristic arguments and numerical experiments we perform indicate that the bounds are in agreement with the actual rate of c...

متن کامل

Upper Bounds on Coarsening Rates in Demixing Binary Viscous Liquids

We consider the demixing process of a binary mixture of two liquids after a temperature quench. Thermodynamics favors two domains of the two different equilibrium volume fractions with a characteristic interfacial layer. After an initial stage, the dynamics are thus driven by the reduction of the interfacial area. Therefore in large systems, one observes an increase in the typical length scale ...

متن کامل

A Multilevel Cooperative Tabu Search Algorithm for the Covering Design Problem

We propose a multilevel cooperative search algorithm to compute upper bounds for Cλ(v, k, t), the minimum number of blocks in a t − (v, k, λ) covering design. Multilevel cooperative search is a search heuristic combining cooperative search and multilevel search. We first introduce a coarsening strategy for the covering design problem which defines reduced forms of an original t − (v, k, λ) prob...

متن کامل

Upper Bounds for Coarsening for the Degenerate Cahn-hilliard Equation

The long time behavior for the degenerate Cahn-Hilliard equation [4, 5, 10], ut = ∇ · (1− u)∇ [Θ 2 {ln(1 + u)− ln(1− u)} − αu− 4u ] , is characterized by the growth of domains in which u(x, t) ≈ u±, where u± denote the ”equilibrium phases;” this process is known as coarsening. The degree of coarsening can be quantified in terms of a characteristic length scale, l(t), where l(t) is prescribed vi...

متن کامل

Bounds on Coarsening Rates for the Lifschitz-slyozov-wagner Equation

This paper is concerned with the large time behavior of solutions to the Lifschitz-Slyozov-Wagner (LSW) system of equations. Point-wise in time upper and lower bounds on the rate of coarsening are obtained for solutions with fairly general initial data. These bounds complement the time averaged upper bounds obtained by Dai and Pego, and the point-wise in time upper and lower bounds obtained by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010